Type Classes and Overloading in Higher-Order Logic
نویسنده
چکیده
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more logical expressiveness. In particular, model-theoretic issues are not affected. Our metalogical results may serve as a foundation of systems like Isabelle/Pure that offer the user Haskell-style order-sorted polymorphism as an extended syntactic feature. The latter can be used to describe simple abstract theories with a single carrier type and a fixed signature of operations.
منابع مشابه
A type classes system for logic programming
This paper describes an extension for logic programming. We propose a flexible logical language that combines overloading and higher-order polymorphism by means of a type classes system. Our proposal consists in classifying the logical predicates, collecting the set of types which share predicates with common application domains in the same type class and particularising more specific applicati...
متن کاملObject-Oriented Verification Based on Record Subtyping in Higher-Order Logic
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some speci c properties of HOL, this encoding turns out to be extremely simple. In particular, structural subtyping is subsumed by naive parametric polymorphism, while overridable generic functions may be based on overloading. Taking HOL plus extensible records as a start...
متن کاملType Inference for Overloading without Restrictions, Declarations or Annotations
This article presents a type system based on the DamasMilner system [DM82], that supports overloading. Types of overloaded symbols are constrained polymorphic types. The work is related to Haskell type classes [Wad89,NP93,HHJW96], System O [OWW95] and other type systems with similar forms of constrained types [Kae88,Smi91,Jon94,DCO96]. Restrictions imposed in these systems with respect to overl...
متن کاملConservative Overloading in Higher-Order Logic
Overloading in the context of higher-order logic has been used for some time now. Isabelle is the only proof-assistant that actually implements overloading within the logic instead of merely instrumenting the pretty-printing machinery on top of the logic. So far there existed no satisfying theory that could explain why it is safe to add a mechanism of certain kinds of possibly overloaded consta...
متن کاملA Combinator-based Order-sorted Higher-order Uniication Algorithm
This paper develops a sound and complete transformation-based algorithm for uniication in an extensional order-sorted combinatory logic supporting constant overloading and a higher-order sort concept. Appropriate notions of order-sorted weak equality and extensionality | reeecting order-sorted-equality in the corresponding lambda calculus given by Johann and Kohlhase | are deened, and the typed...
متن کامل